Collective dynamics of phase-repulsive oscillators solves graph coloring problem
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولCollective dynamics of identical phase oscillators with high-order coupling
In this paper, we propose a framework to investigate the collective dynamics in ensembles of globally coupled phase oscillators when higher-order modes dominate the coupling. The spatiotemporal properties of the attractors in various regions of parameter space are analyzed. Furthermore, a detailed linear stability analysis proves that the stationary symmetric distribution is only neutrally stab...
متن کاملEvolutionary design of non-frustrated networks of phase-repulsive oscillators
Evolutionary optimisation algorithm is employed to design networks of phase-repulsive oscillators that achieve an anti-phase synchronised state. By introducing the link frustration, the evolutionary process is implemented by rewiring the links with probability proportional to their frustration, until the final network displaying a unique non-frustrated dynamical state is reached. Resulting netw...
متن کاملRepulsive synchronization in an array of phase oscillators.
We study the dynamics of a repulsively coupled array of phase oscillators. For an array of globally coupled identical oscillators, repulsive coupling results in a family of synchronized regimes characterized by zero mean field. If the number of oscillators is sufficiently large, phase locking among oscillators is destroyed, independently of the coupling strength, when the oscillators' natural f...
متن کاملDNA Solution of a Graph Coloring Problem
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science
سال: 2020
ISSN: 1054-1500,1089-7682
DOI: 10.1063/1.5127794